Some Error-Correcting Pooling Designs Associated with Johnson Graphs and Grassmann Graphs
نویسندگان
چکیده
Based on the inclusion matrices of t-cliques with various sizes of Johnson graphs J(n, t) and Grassmann graphs Jq(n, t) respectively, two families of errorcorrecting pooling designs are given, some of their properties including the errorcorrecting capability together with two parameters ed and e≤dare studied. With an interpretation of matchings K2m of as 2-cliques of Johnson graph J(n, 2), this gives a q-analogue of the pooling designs defined over matchings of K2m given by Ngo and Du.
منابع مشابه
Subclose Families, Threshold Graphs, and the Weight Hierarchy of Grassmann and Schubert Codes
We discuss the problem of determining the complete weight hierarchy of linear error correcting codes associated to Grassmann varieties and, more generally, to Schubert varieties in Grassmannians. In geometric terms, this corresponds to determining the maximum number of Fq-rational points on sections of Schubert varieties (with nondegenerate Plücker embedding) by linear subvarieties of a fixed (...
متن کاملReciprocal Degree Distance of Grassmann Graphs
Recently, Hua et al. defined a new topological index based on degrees and inverse of distances between all pairs of vertices. They named this new graph invariant as reciprocal degree distance as 1 { , } ( ) ( ( ) ( ))[ ( , )] RDD(G) = u v V G d u d v d u v , where the d(u,v) denotes the distance between vertices u and v. In this paper, we compute this topological index for Grassmann graphs.
متن کاملConstructing error-correcting pooling designs with symplectic space
We construct a family of error-correcting pooling designs with the incidence matrix of two types of subspaces of symplectic spaces over finite fields. We show that the new construction gives better ratio of efficiency compared with previously known three constructions associated with subsets of a set, its analogue over a vector space, and the dual spaces of a symplectic space.
متن کاملA class of error-correcting pooling designs over complexes
As a generalization of d-disjunct matrices and (w, r;d)-cover-freefamilies, the notion of (s, l)-disjunct matrices is introduced for error-correcting pooling designs over complexes (or set pooling designs). We show that (w, r, d)cover-free-families form a class of (s, l)-disjunct matrices. Moreover, a decoding algorithm for pooling designs based on (s, l)-disjunct matrices is considered.
متن کاملError-correcting codes from k-resolving sets
We demonstrate a construction of error-correcting codes from graphs by means of k-resolving sets, and present a decoding algorithm which makes use of covering designs. Along the way, we determine the k-metric dimension of grid graphs (i.e. Cartesian products of paths). MSC 2010: 05C12, 94B25 (primary); 05B40, 94B35 (secondary).
متن کامل